منابع مشابه
Recognition and Characterization of Chronological Interval Digraphs
Interval graphs admit elegant ordering and structural characterizations as well as linear time recognition algorithms. On the other hand, the usual interval digraphs lack all three of these characteristics. In this paper we identify another natural digraph analogue of interval graphs that we call “chronological interval digraphs”. By contrast, the new class admits an ordering characterization, ...
متن کاملBalanced vertex-orderings of graphs
In this paper we consider the problem of determining a balanced ordering of the vertices of a graph; that is, the neighbors of each vertex v are as evenly distributed to the left and right of v as possible. This problem, which has applications in graph drawing for example, is shown to be NP-hard, and remains NP-hard for bipartite simple graphs with maximum degree six. We then describe and analy...
متن کاملLexBFS-Orderings and Power of Graphs
1 I n t r o d u c t i o n Powers of graphs play an impor t an t role for solving cer tain problems re la ted to dis tances in graphs : p -cen te r and q-dispers ion (el. [7, 3]), k d o m i n a t i o n and k -s tab i l i ty (of. [8, 3]), d iamete r (of. [13]), k -colour ing (cf. [26, 20]) and approx ima t ion of bandwid th (el. [27]). For instance, consider the k-co lour ing problem. The vertice...
متن کاملTopological orderings of weighted directed acyclic graphs
We call a topological ordering of a weighted directed acyclic graph non-negative if the sum of weights on the vertices in any prefix of the ordering is non-negative. We investigate two processes for constructing non-negative topological orderings of weighted directed acyclic graphs. The first process is called a mark sequence and the second is a generalization called a mark-unmark sequence. We ...
متن کاملLinear Orderings of Random Geometric Graphs
In random geometric graphs, vertices are randomly distributed on [0, 1] and pairs of vertices are connected by edges whenever they are sufficiently close together. Layout problems seek a linear ordering of the vertices of a graph such that a certain measure is minimized. In this paper, we study several layout problems on random geometric graphs: Bandwidth, Minimum Linear Arrangement, Minimum Cu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1984
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90080-5